An Adaptive Iterated Local Search for the Mixed Capacitated General Routing Problem
نویسندگان
چکیده
منابع مشابه
An Adaptive Iterated Local Search for the Mixed Capacitated General Routing Problem
We study the Mixed Capacitated General Routing Problem (MCGRP) in which a fleet of capacitated vehicles has to serve a set of requests by traversing a mixed weighted graph. The requests may be located on nodes, edges, and arcs. The problem has theoretical interest because it is a generalization of the Capacitated Vehicle Routing Problem (CVRP), the Capacitated Arc Routing Problem (CARP), and th...
متن کاملAn Imperialist Competitive Algorithm and a Mixed Integer Programming Formulation for the Capacitated Vehicle Routing Problem
The Vehicle Routing Problem (VRP), a famous problem of operation research, holds a central place in combinatorial optimization problems. In this problem, a fleet vehicles with Q capacity start to move from depot and return after servicing to customers in which visit only ones each customer and load more than its capacity not at all. The objective is to minimize the number of used vehicles and t...
متن کاملA matheuristic algorithm for the mixed capacitated general routing problem
We study the general routing problem de ned on a mixed graph and subject to capacity constraints. Such a problem aims to nd the set of routes of minimum overall cost servicing a subset of required elements like vertices, arcs and edges, without exceeding the capacity of a eet of homogeneous vehicles based at the same depot. The problem is a generalization of a large variety of node and arc rout...
متن کاملThe mixed capacitated general routing problem under uncertainty
We study the General Routing Problem defined on a mixed graph and with stochastic demands. The problem under investigation is aimed at finding the minimum cost set of routes to satisfy a set of clients whose demand is not deterministically known. Since each vehicle has a limited capacity, the demand uncertainty occurring at some clients affects the satisfaction of the capacity constraints, that...
متن کاملThe mixed capacitated general routing problem with turn penalties
0957-4174/$ see front matter 2011 Elsevier Ltd. A doi:10.1016/j.eswa.2011.04.092 ⇑ Corresponding author. Tel.: +34963877007x7666 E-mail addresses: [email protected] (O. Bräy Martínez), [email protected] (Y. Nagata), dsole In this paper we deal with the mixed capacitated general routing problem with turn penalties. This problem generalizes many important arc and node routing proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Science
سال: 2016
ISSN: 0041-1655,1526-5447
DOI: 10.1287/trsc.2015.0660